The Factor-2 Sign Detection Algorithm using a core function for RNS numbers
نویسندگان
چکیده
منابع مشابه
Efficient Fast Sign Detection Algorithm for the RNS Moduli Set
This brief presents a fast sign detection algorithm for the residue number system moduli set {2 n+1 − 1, 2 n − 1, 2 n }. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2 n+1 − 1, 2 n − 1, 2 n } is proposed based on t...
متن کاملSign detection algorithm using carry look ahead adder for the RNS Module Set 2n+1,2n-1,2n
The Residue Number System (RNS) is a non-weighted system that is very efficient in digital signal processing and communicational applications. The previous proposed methods for the residue to binary (R/B) conversions are based on the Chinese Reminder Theorem (CRT) or Mixed Radix Conversion (MRC). These theorems are difficult to implement. In this paper, we present a new highspeed ROM-less resid...
متن کاملAn Approximate Sign Detection Method for Residue Numbers and its Application to RNS Division
we present new division algorithms for Residue Number System (RNS). The algorithms are based on a sign estimation procedure that computes the sign of a residue number to be positive, negative, or indeterminate. In the last case, magnitude of the number is guaranteed to be in a limited interval whose size is related to the cost of the sign estimation process. Our division algorithms resemble SRT...
متن کاملScaling an RNS Number Using the Core Function
This paper introduces a method for extracting the core of a Residue Number System (RNS) number within the RNS, this affording a new method for scaling RNS numbers. Suppose an RNS comprises a set of co-prime moduli, mi, with ∏mi = M. This paper describes a method for approximately scaling such an RNS number by a subset of the moduli, ∏mj = MJ ≈ √M, with the characteristic that all computations a...
متن کاملFast Sign Detection Algorithm for the RNS Moduli Set 2n+1-1, 2n-1, 2n
This brief presents a fast sign detection algorithm for the residue number system moduli set {2n+1 − 1, 2n − 1, 2n}. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2007
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2006.03.034